Faster Unfolding of General Petri Nets

We propose two new unfolding semantics for general Petri nets based on the concept of prime event structures. The definitions of the two unfolding models are motivated by algorithmic aspects. We develop a construction algorithm for both unfolding models. The unfolding models employ the idea of token flows developed in [JLD05] and are much smaller than the standard unfolding model. We show that they still represent the complete partial order behaviour of the given net. Since the models are smaller, they can be constructed much faster.